Bounds For Markovian Queues With Possible Catastrophes

نویسندگان

  • Alexander I. Zeifman
  • Anna Korotysheva
  • Yacov Satin
  • Ksenia Kiseleva
  • Victor Korolev
  • Sergey Shorgin
چکیده

We consider a general Markovian queueing model with possible catastrophes and obtain new and sharp bounds on the rate of convergence. Some special classes of such models are studied in details, namely, (a) the queueing system with S servers, batch arrivals and possible catastrophes and (b) the queueing model with “attracted” customers and possible catastrophes. A numerical example illustrates the calculations. Our approach can be used in modeling information flows related to high-performance computing. INTRODUCTION There is a large number of papers devoted to the research of Markovian queueing models with possible catastrophes, see for instance, [1], [3], [2], [10], [11], [17], [18], [19], [21], [24], [25] and the references therein. Such models are widely used in simulations for hight-performance computing. In particular, in some recent papers the authors deal with more or less special birth-death processes with additional transitions from and to origin [1], [2], [3], [10], [11], [21], [24], [25]. In the present paper we consider a more general class of Markovian queueing models with possible catastrophes and obtain key bounds on the rate of convergence, which allow us to compute the limiting characteristics of the corresponding processes. Namely, we suppose that the queue-length process is an inhomogeneous continuous-time Markov chain {X(t), t ≥ 0} on the state space E = {0, 1, 2 . . . }. All possible transition intensities are assumed to be non-random functions of time and may depend on the state of the process. From any state i the chain can jump to any another state j > 0 with transition intensity qij(t). Moreover, the transition functions from state i > 0 to state 0 (catastrophe intensities) are βi(t). Denote by pij (s, t) = P {X (t) = j |X (s) = i}, i, j ≥ 0, 0 ≤ s ≤ t the probability of transition X (t), and by pi (t) = P {X (t) = i} the corresponding state probability that X (t) is in state i at the moment t. Let p (t) = (p0 (t) , p1 (t) , . . . ) T be the vector of state probabilities at the moment t. Throughout the paper we suppose that for any i, j P (X (t+ h) = j|X (t) = i) = =  qij (t)h+ αij (t, h) , if j 6= i, βi (t)h+ αi0 (t, h) = qi0(t) + αi0(t, h), if j = 0, i > 1, 1− ∑ j 6=i qij(t)h+ αi (t, h) , if j = i, (1) where sup i |αi(t, h)| = o(h). (2) Let Q(t) be the corresponding intensity matrix. We suppose that all intensity functions are non-negative and locally integrable on [0,∞). Put aij (t) = qji (t) for j 6= i and aii (t) = − ∑

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Mn(t)/Mn(t)/S queues with catastrophes

The simplest (stationary) queueing models with catastrophes have been studied some years ago, see for instance [1–6, 9]. Namely, when the queue is not empty, catastrophes may occur with the respective rates. The effect of each catastrophe is to make the queue instantly empty. Simultaneously, the system becomes ready to accept new customers. Nonstationary Markovian queueing models (birthdeath pr...

متن کامل

Large Deviations Bounds for a Polling System with Markovian On/off Sources and Bernoulli Service Schedule

In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Upper Bounds on Performance Measures of Heterogeneous M/M/c Queues

In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion o...

متن کامل

Alternative approaches for the transient analysis of Markov chains with catastrophes

In this paper we present various approaches for the transient analysis of a Markovian population process with total catastrophes. We discuss the pros and the cons of these methodologies and point out how they lead to different tractable extensions. As an illustrating example, we consider the non-homogeneous Poisson process with total catastrophes. The extension of the probabilistic methodologie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017